Distributed storage systems with secure and exact repair - New results
نویسندگان
چکیده
Distributed storage systems (DSS) in the presence of a passive eavesdropper are considered in this paper. A typical DSS is characterized by 3 parameters (n, k, d) where, a file is stored in a distributed manner across n nodes such that it can be recovered entirely from any k out of n nodes. Whenever a node fails, d 2 [k, n) nodes participate in the repair process. In this paper, we study the exact repair capabilities of a DSS, where a failed node is replaced with its exact replica. Securing this DSS from a passive eavesdropper capable of wiretapping the repair process of any l < k nodes, is the main focus of this paper. Specifically, we characterize the optimal secure storagevs-exact-repair-bandwidth tradeoff region for the (4, 2, 3) DSS when l = 1 and the (n, n 1, n 1) DSS when l = n 2.
منابع مشابه
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملGreen Energy Generation in Buildings: Grid-Tied Distributed Generation Systems (DGS) With Energy Storage Applications to Sustain the Smart Grid Transformation
The challenge of electricity distribution’s upgrade to incorporate new technologies is big, and electric utilities are mandated to work diligently on this agenda, thus making investments to ensure that current networks maintain their electricity supply commitments secure and reliable in face of disruptions and adverse environmental conditions from a variety of sources. The paper presents a new ...
متن کاملDistributed Storage Systems: A New Approach
Characterizing the exact repair storage-vs-repair bandwidth tradeoff for distributed storage systems remains an open problem for more than four storage nodes. Motivated by the prevalence and practical applicability of linear codes, the exact repair problem when restricted to linear codes is considered. The main result of this paper is a new approach to develop bounds for exact repair distribute...
متن کاملExact-Regeneration Distributed Storage Codes
Characterizing the exact repair storage-vs-repair bandwidth tradeoff for distributed storage systems remains an open problem for more than five storage nodes. Motivated by the prevalence and practical applicability of linear codes, the exact repair problem when restricted to linear codes is considered. The main result of this paper is a new approach to develop bounds for exact repair distribute...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کامل